Packet randomized experiments for eliminating classes of confounders
نویسندگان
چکیده
منابع مشابه
Randomized Cache Placement for Eliminating Connicts
| Applications with regular patterns of memory access can experience high levels of cache connict misses. In shared-memory multiprocessors connict misses can be increased signiicantly by the data transpositions required for parallelization. Techniques such as blocking which are introduced within a single thread to improve locality, can result in yet more connict misses. The tension between mini...
متن کاملRandomized Cache Placement for Eliminating Conflicts
ÐApplications with regular patterns of memory access can experience high levels of cache conflict misses. In sharedmemory multiprocessors conflict misses can be increased significantly by the data transpositions required for parallelization. Techniques such as blocking which are introduced within a single thread to improve locality, can result in yet more conflict misses. The tension between mi...
متن کاملPacket Scheduling of Two Classes Flow
Various techniques have been proposed to achieve good QoS for diverse application types at network nodes. In order to supply the various QoS requirements for different kinds of applications, new scheduling policies need to be developed and evaluated. Many scheduling techniques have been proposed to respond to the temporal requirements of real-time flows. We propose a new scheduling Hierarchical...
متن کاملRandomized Initialization Protocols for Packet Radio Networks
The main contribution of this work is to propose efficient randomized leader election and initialization protocols for Packet Radio Networks (PRN, for short). As a result of the initialization protocol, the n stations of a PRN are assigned distinct integer IDs from 1 ton. The results include protocols to: (1) initialize the single-channel PRN with the collision detection (CD) capability in O(n)...
متن کاملNearly optimal FIFO buffer management for two packet classes q
We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. We assume that each packet has value which is either 1 or a, for some a > 1. The buffer management task is to decide which packets to drop so as to minimize the total value of lost packets, subject to the buffer space bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Clinical Investigation
سال: 2014
ISSN: 0014-2972
DOI: 10.1111/eci.12378